Rational functions with linear relations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rational Functions with Linear Relations

We find all polynomials f, g, h over a field K such that g and h are linear and f(g(x)) = h(f(x)). We also solve the same problem for rational functions f, g, h, in case the field K is algebraically closed.

متن کامل

Recurrence relations for orthogonal rational functions

It is well known that members of families of polynomials, that are orthogonal with respect to an inner product determined by a nonnegative measure on the real axis, satisfy a three-term recursion relation. Analogous recursion formulas are available for orthogonal Laurent polynomials with a pole at the origin. This paper investigates recursion relations for orthogonal rational functions with arb...

متن کامل

Random Functions Satisfying Certain Linear Relations

i1 "L-d! said my mother, what is all this story about?-A Cock and a Bull, said Yorick-" (Tristram Shandy) iii ACKNOWLEDGMENT At the outset, I would like to express my sincere and heartfelt thanks to Dr. Herbert Robbins for his constant advice and help, and for his patience with me. financial assistance and other facilities which were provided me during the progress of this work. summer of 1950;...

متن کامل

Monotone Linear Relations: Maximality and Fitzpatrick Functions

We analyze and characterize maximal monotonicity of linear relations (set-valued operators with linear graphs). An important tool in our study are Fitzpatrick functions. The results obtained partially extend work on linear and at most single-valued operators by Phelps and Simons and by Bauschke, Borwein and Wang. Furthermore, a description of skew linear relations in terms of the Fitzpatrick fa...

متن کامل

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2007

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-07-09246-5